Digital News Graph Clustering using Chinese Whispers Algorithm
نویسندگان
چکیده
منابع مشابه
Chinese Whispers - An Efficient Graph Clustering Algorithm And Its Application To Natural Language Processing Problems
We introduce Chinese Whispers, a randomized graph-clustering algorithm, which is time-linear in the number of edges. After a detailed definition of the algorithm and a discussion of its strengths and weaknesses, the performance of Chinese Whispers is measured on Natural Language Processing (NLP) problems as diverse as language separation, acquisition of syntactic word classes and word sense dis...
متن کاملChinese whispers
I didn’t really mind having the maitre ‘d take my temperature each morning at breakfast. I didn’t really mind staying in a towering hotel that had more staff than guests. And I didn’t mind that so many people went about town in cotton masks over their mouths. But, one night over dinner in an empty restaurant, I was nonplussed when my dining companion, Laurie Garrett, remarked that we were the o...
متن کاملChinese Whispers: Cooperative Paraphrase Acquisition
We present a framework for the acquisition of sentential paraphrases based on crowdsourcing. The proposed method maximizes the lexical divergence between an original sentence s and its valid paraphrases by running a sequence of paraphrasing jobs carried out by a crowd of non-expert workers. Instead of collecting direct paraphrases of s, at each step of the sequence workers manipulate semantical...
متن کاملHTTP Traffic Graph Clustering using Markov Clustering Algorithm
Graph-based techniques and analysis have been used for IP network traffic analysis. The objective of this paper is to study the hosts' interaction behavior and use graph clustering algorithm, the Markov clustering algorithm, to group (cluster) hosts which have interaction using the HTTP protocol. Using real network traces, the clustering results show that MCL algorithm successfully group t...
متن کاملChinese whispers and connected alignments
This paper investigates the idea to treat repositories of ontologies as interlinked networks of ontologies, formally captured by the notion of a hyperontology. We apply standard matching algorithms to automatically create the linkage structure of the repository by performing pairwise matching. Subsequently, we define a modular workflow to construct combinations of alignments for any finite numb...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics: Conference Series
سال: 2017
ISSN: 1742-6588,1742-6596
DOI: 10.1088/1742-6596/801/1/012062